On the Commuting Graph of Semidihedral Group
نویسندگان
چکیده
The commuting graph $$\varDelta (G)$$ of a finite non-abelian group G is simple with vertex set G, and two distinct vertices x, y are adjacent if $$xy = yx$$ . In this paper, first we discuss some properties We determine the edge connectivity minimum degree prove that both equal. Then, other invariants, namely: matching number, clique boundary vertex, studied. Also, give necessary sufficient condition on such interior center Further, investigate semidihedral $$SD_{8n}$$ connection, various invariants (SD_{8n})$$ including connectivity, independence number detour properties. also obtain Laplacian spectrum, metric dimension resolving polynomial
منابع مشابه
characterization of the symmetric group by its non-commuting graph
the non-commuting graph $nabla(g)$ of a non-abelian group $g$ is defined as follows: its vertex set is $g-z(g)$ and two distinct vertices $x$ and $y$ are joined by an edge if and only if the commutator of $x$ and $y$ is not the identity. in this paper we 'll prove that if $g$ is a finite group with $nabla(g)congnabla(bs_{n})$, then $g cong bs_{n}$, where $bs_{n}$ is the symmetric group of degre...
متن کاملThe Automorphism Group of Commuting Graph of a Finite Group
Let G be a finite group and X be a union of conjugacy classes of G. Define C(G,X) to be the graph with vertex set X and x, y ∈ X (x 6= y) joined by an edge whenever they commute. In the case that X = G, this graph is named commuting graph of G, denoted by ∆(G). The aim of this paper is to study the automorphism group of the commuting graph. It is proved that Aut(∆(G)) is abelian if and only if ...
متن کاملNon - commuting graph of a group ✩
Let G be a non-abelian group and let Z(G) be the center of G. Associate a graph ΓG (called noncommuting graph of G) with G as follows: Take G\Z(G) as the vertices of ΓG and join two distinct vertices x and y, whenever xy = yx. We want to explore how the graph theoretical properties of ΓG can effect on the group theoretical properties of G. We conjecture that if G and H are two non-abelian finit...
متن کاملOn the diameter of the commuting graph of the full matrix ring over the real numbers
In a recent paper C. Miguel proved that the diameter of the commuting graph of the matrix ring $mathrm{M}_n(mathbb{R})$ is equal to $4$ if either $n=3$ or $ngeq5$. But the case $n=4$ remained open, since the diameter could be $4$ or $5$. In this work we close the problem showing that also in this case the diameter is $4$.
متن کاملRemarks On Commuting Graph of a Finite Group
The commuting graph ∆(G) of a group G is the graph whose vertex set is the group and two distinct elements x and y being adjacent if and only if xy = yx. In this paper the automorphism group of this graph is investigated. We observe that Aut(∆(G)) is a non-abelian group such that its order is not prime power and square-free.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Malaysian Mathematical Sciences Society
سال: 2021
ISSN: ['2180-4206', '0126-6705']
DOI: https://doi.org/10.1007/s40840-021-01111-0